Mathematical Models and a Constructive Heuristic for finding Minimum Fundamental Cycle Bases
نویسندگان
چکیده
The problem of finding a fundamental cycle basis with minimum total cost in a graph arises in many application fields. In this paper we present some integer linear programming formulations and we compare their performances, in terms of: instance size, CPU time required for the solution, and quality of the associated lower bound derived by solving the corresponding continuous relaxations. Since only very small instances can be solved to optimality with these formulations and very large instances occur in a number of applications, we present a new constructive heuristic and compare it with other existing heuristics.
منابع مشابه
Edge-swapping algorithms for the minimum fundamental cycle basis problem
We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and variable neighborhood search in which edge swaps are iteratively applied to a current spanning tree. We als...
متن کاملBenchmarks for Strictly Fundamental Cycle Bases
In the MINIMUM STRICTLY FUNDAMENTAL CYCLE BASIS (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum. We identify square planar grid graphs as being very challenging testbeds for the MSFCB. The best lower and upper bounds for this problem are due to Alon, Karp, Peleg, and West (1995) and to Amaldi et al. (2004). We im...
متن کاملOverview of Portfolio Optimization Models
Finding the best way to optimize the portfolio after Markowitz's 1952 article has always been and will continue to be one of the concerns of activists in the investment management industry. Researchers have come up with different solutions to overcome this problem. The introduction of mathematical models and meta-heuristic models is one of the activities that has influenced portfolio optimizati...
متن کاملSIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملControlling Constructive Induction in CIPF: An MDL Approach
We describe the learning system CiPF, which tightly couples a simple concept learner with a sophisticated constructive induction component. It is described in terms of a generic architecture for constructive induction. We focus on the problem of controlling the abundance of opportunities for constructively adding new attributes. In CiPF the so-called Minimum Description Length (MDL) principle a...
متن کامل